例句與造句

1. Various convex hull algorithms deal both with the facet enumeration and face lattice construction.
2. Therefore some research of dynamic convex hull algorithms involves the computational complexity of various geometric search problems with convex hulls stored in specific kinds of data structures.
3. The convex hull problem can be solved through linear programming or through convex hull algorithms, but the process of finding the convex hull is an exponential problem.
4. Otherwise you might be interested in the gift wrapping algorithm which is one of the Convex hull algorithms which will order the points round the quadrilateral so finding the diagonals is easy.
5. The lower bound on worst-case running time of output-sensitive convex hull algorithms was established to be & Omega; ( " n " log " h " ) in the planar case.
6. It's difficult to find convex hull algorithms in a sentence. 用convex hull algorithms造句挺難的
7. Consequently, output-sensitive algorithms such as the ultimate convex hull algorithm and Chan's algorithm which require only O ( " n " log " h " ) time are considerably faster for such point sets.
8. Chan's algorithm, another convex hull algorithm, combines the logarithmic dependence of Graham scan with the output sensitivity of the gift wrapping algorithm, achieving an asymptotic running time O ( n \ log h ) that improves on both Graham scan and gift wrapping.
9. Convex hull algorithms for finding the convex hull of a finite set of points in the plane require ? ( " n " log " n " ) time for " n " points; even relatively simple algorithms like the Graham scan achieve this lower bound.